Bibliography of Team Automata

نویسنده

  • Maurice H. ter Beek
چکیده

This paper introduces a mathematical model of groupware systems called Team Automata. We use this model at the architectural level, to describe components of a groupware system, and their interconnections. The multiple automata constituting the team interact via shared actions transitions which multiple automata perform synchronously together. The paper concludes by illustrating the application of this model to the analysis of real time shared application groupware. The model suggests that there are design alternatives for shared application groupware which have mostly gone unexplored. [2] M.H. ter Beek, C.A. Ellis, J. Kleijn, and G. Rozenberg. Synchronizations in Team Automata for Groupware Systems. Technical Report TR-99-12, Leiden Institute of Advanced Computer Science, Leiden University, 1999. URL: http://fmt.isti.cnr.it/ mtbeek/TR-99-12.ps.gz Abstract: Team automata have been proposed in [1] as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions. At the conceptual level, our model serves as a formal framework in which such basic groupware notions as cooperation and collaboration can be rigorously defined and studied. At the architectural level, team automata can be used as buildings blocks in the design of groupware systems. Team automata have been proposed in [1] as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team automata in a mathematically precise way in terms of component automata which synchronize on certain executions of actions. At the conceptual level, our model serves as a formal framework in which such basic groupware notions as cooperation and collaboration can be rigorously defined and studied. At the architectural level, team automata can be used as buildings blocks in the design of groupware systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks

High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...

متن کامل

Team Automata Satisfying Compositionality

A team automaton is said to satisfy compositionality if its behaviour can be described in terms of the behaviour of its constituting component automata. As an initial investigation of the conditions under which team automata satisfy compositionality, we study their computations and behaviour in relation to those of their constituting component automata. We show that the construction of team aut...

متن کامل

Vector team automata

Vector team automata are team automata with an explicit representation of synchronizations. This makes a translation possible of a subclass of vector team automata into individual token net controllers, a model of labeled Petri nets developed within the framework of vector controlled concurrent systems. © 2011 Elsevier B.V. All rights reserved.

متن کامل

Corruption - A selected and annotated bibliography

Acknowledgements A team of two researchers from Chr. Michelsen Institute (CMI) has prepared this annotated bibliography on "corruption": Inge Amundsen (political scientist). His research focus is comparative politics of democratisation, institutionalisation and reform, political parties, and state and civil society relations. Odd-Helge Fjeldstad (economist). His research focuses on corruption, ...

متن کامل

A Calculus for Team Automata

Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patterns among systems, thus extending I/O automata. Furthermore, for some patterns the language recognized by a team automaton can be specified via those languages recognized by its components. We introduce a process calcul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015